Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
181	How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-10-27 20:33:15 Polynomials Matroid theory Tutte polynomial Time complexity IP XTR PP P/poly Bounded-error probabilistic polynomial Theoretical computer science Mathematics Computational complexity theory
182	When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor∗ Omer Reingold Salil Vadhan Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-11-01 14:13:39 Data privacy Applied probability Exponential mechanism Time complexity Differential privacy Constructible universe Polynomial Negligible function PP Theoretical computer science Mathematics Computational complexity theory
183	Beyond Simple Aggregates: Indexing for Summary Queries Zhewei Wei Ke Yi Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2011-04-13 05:29:29 Rope Time complexity FO Scapegoat tree Theoretical computer science Binary trees Applied mathematics
184	Advanced Algorithms 2012A – Problem Set 4 Robert Krauthgamer December 23, Prove that the number of connected components in a graph G is equal to the multiplicity of 0 among the eigenvalues of LG (the Laplacian Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English Analysis of algorithms Algebraic graph theory Conductance Matrices Probability theory Cheeger constant Isoperimetric inequality Algorithm Time complexity Mathematics Graph theory Theoretical computer science
185	Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-05-17 00:53:00 Quantum complexity theory Probabilistic complexity theory Models of computation Analysis of algorithms Randomized algorithm PP Decision tree model IP MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
186	arXiv:1209.5993v4 [cs.CC] 11 SepGeometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma Dedicated to Sri Ra Add to Reading List Source URL: gct.cs.uchicago.edu Language: English - Date: 2013-11-07 17:14:04 Analysis of algorithms Invariant theory Probabilistic complexity theory Randomized algorithm Time complexity Emmy Noether SC Polynomial Circuit complexity Theoretical computer science Computational complexity theory Mathematics
187	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
188	PDF Document Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics
189	Cache-Oblivious Simulation of Parallel Programs Andrea Pietracaprina, Geppino Pucci, and Francesco Silvestri Department of Information Engineering, University of Padova, Italy {capri,geppo,silvest1}@dei.unipd.it Abstrac Add to Reading List Source URL: www.itu.dk Language: English - Date: 2015-01-07 05:01:30 Analysis of algorithms Cache Computer memory Computational complexity theory Cache-oblivious algorithm CPU cache Fast Fourier transform Time complexity Parallel computing Theoretical computer science Applied mathematics Mathematics
190	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE